HACCP体系用于给水处理厂浊度控制的研究

介绍了危害分析和关键控制点（HACCP）体系的基本原理及其在城市给水系统中的应用进展，并以我国南方某城市的给水处理厂为例，对HACCP体系用于水厂浊度控制开展了探索性研究。应用故障树分析技术识别了水厂中可能导致浊度超标的潜在危害，应用决策树分析技术确定了水厂浊度控制的关键控制点，建立了关键控制点和质量控制点的关键限值、监控系统以及纠偏措施，并分析了对验证程序以及文件和记录保存系统的要求。     

海底管道系统失效故障树的建立及定性分析

受自然环境、管道腐蚀、第三方破坏及管理不善等因素的影响,海底管道系统在铺设及运行过程中常常会失效。文中以海底管道穿孔、凝管、断裂和设备故障等主要失效形式为顶事件建立了海底管道系统失效故障树,通过系统的定性分析得到了海底管道系统失效故障树的37个一阶最小割集,进而确定了影响海底管道系统失效的4项主要因素,并针对这些主要因素提出了相应的解决问题的措施。     

Education-driven research in CAD

We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals.     

一种三叉树的存储结构及其基本操作的实现

本文在文献［１］所给出的有关三叉树有其相关概念的基础上，提出了一种新的三叉树存储结构，即“儿子－兄弟链表”方法，并在这种结构下，对三叉树的基本操作的实现算法进行了较详细的讨论。     

神经网络分类器的快速构造算法

使用ＢＰ算法训练多层网络的速度很慢而且事先难于确定隐节点和隐层的适当数目。本文提出一个有效的算法，先构造决策树，然后将构造的决策树转换为神经网。文中使用一个全局准则函数控制决策树的增长，它较好地匹配了树的复杂性和训练样本量及错分率界。实验结果，本文的算法比用ＢＰ算法训练多层网络要快，而其分类精度不低于用ＢＰ算法训练的多层神经网。     

最小生成树的高效异步并行算法

在ＭＩＭＤ－ＳＭ并行计算模型上，本文给出了时间复杂性为Ｏ（ｎ（ｎ／ｐ＋ｌｏｇｐ））的最小生成树的异步并行算法，其中ｎ，ｐ（１≤ｐ≤ｎ）分别表示图的顶点数和处理机的个数。     

Sidle的远程执行设备

Ｓｉｄｌｅ系统是运行在ＳＵＮ工作站网络上的一组实用程序，利用空闲的处理机资源进行大粒度的并行计算．同其它远程执行设备相比，它能支持程序内部并行和嵌套的远程执行，允许一个服务员机接受多个远程执行任务．本文介绍了这些特点和透明性的实现方法．     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

基于OpenGL五轴联动数控仿真系统碰撞干涉检验实时仿真技术及算法研究

介绍了Com-5NCSS五轴联动数控仿真系统运用的“实时仿真”技术，在此基础上提出基于规则实体表面网格化遍历的八叉树单球组合模型，该模型应用于Com-5NCSS仿真系统中，实现了碰撞干涉的快速检测，满足了数控仿真系统的“实时性”要求。     

Reliability-based failure cause assessment of collapsed bridge during construction

Until now, in many forensic reports, the failure cause assessments are usually carried out by a deterministic approach so far. However, it may be possible for the forensic investigation to lead to unreasonable results far from the real collapse scenario, because the deterministic approach does not systematically take into account any information on the uncertainties involved in the failures of structures.Reliability-based failure cause assessment (reliability-based forensic engineering) methodology is developed which can incorporate the uncertainties involved in structural failures and structures, and to apply them to the collapsed bridge in order to identify the most critical failure scenario and find the cause that triggered the bridge collapse. Moreover, to save the time and cost of evaluation, an algorithm of automated event tree analysis (ETA) is proposed and possible to automatically calculate the failure probabilities of the failure events and the occurrence probabilities of failure scenarios. Also, for reliability analysis, uncertainties are estimated more reasonably by using the Bayesian approach based on the experimental laboratory testing data in the forensic report. For the applicability, the proposed approach is applied to the Hang-ju Grand Bridge, which collapsed during construction, and compared with deterministic approach.